An Efficient Algorithm for Finding Structural Deadlocks in Colored Petri Nets

Inn this paper, we present ann algorithm to compute structural deadlocks inn coloredd nets under specifiedd conditions. Insteadd of appl ying the ordinary algorithm onn the unfoldedd Petri net, our algorithm take s advantage of the structure of the color functions. It is obtainedd by iterat ive optimizations of the ordinary algorithm. Eachh optimizationn is specifiedd by a m eta-rule, whose applicationn is detectedd during the computationn of the algorithm. The applicationn of suchh metarules speeds upp a stepp of the algorithm withh a factor proportional to the size of a color domain. We illustrate the efficiency of this algorithm comparedd to the classical approachh onn a coloredd net modelling the dining philosophers problem.